منابع مشابه
Localized K-Flats
K-flats is a model-based linear manifold clustering algorithm which has been successfully applied in many real-world scenarios. Though some previous works have shown that K-flats doesn’t always provide good performance, little effort has been devoted to analyze its inherent deficiency. In this paper, we address this challenge by showing that the deteriorative performance of K-flats can be attri...
متن کاملLearning Manifolds with K-Means and K-Flats
We study the problem of estimating a manifold from random samples. In particular, we consider piecewise constant and piecewise linear estimators induced by k-means and k-flats, and analyze their performance. We extend previous results for k-means in two separate directions. First, we provide new results for k-means reconstruction on manifolds and, secondly, we prove reconstruction bounds for hi...
متن کاملNon-Poisson distribution of the time distances between two consecutive clusters of earthquakes
With the help of the Diffusion Entropy technique we show the non-Poisson statistics of the distances between consecutive Omori’s swarms of earthquakes. We give an analytical proof of the numerical results of an earlier paper [Mega et al., Phys. Rev. Lett. 90 (2003) 188501].
متن کاملStabbing Simplices of Point Sets with k-flats
Let S be a set of n points in Rd in general position. A set H of k-flats is called an mk-stabber of S if the relative interior of any m-simplex with vertices in S is intersected by at least one element of H. In this paper we give lower and upper bounds on the size of minimum mk-stabbers of point sets in Rd and in general position. We study mainly mk-stabbers in the plane and in R3.
متن کاملAdditive Distances and Quasi-Distances Between Words
We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. Finally, similar results will be proven for context-free, computable and computably enumerable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2013
ISSN: 1387-5841,1573-7713
DOI: 10.1007/s11009-012-9319-2